-
1 graph-based algorithm
Микроэлектроника: алгоритм основанный на теории графов, графоориентированный алгоритм -
2 algorithm
- ad hoc algorithm
- adaptive algorithm
- aim algorithm
- algorithm for path connections
- automatic assessment algorithm
- back-propagation algorithm
- banker's algorithm
- best-route algorithm
- bicomponent algorithm
- bipartitioning algorithm
- bisection algorithm
- branch-bound algorithm
- branching algorithm
- cascading algorithm
- chain algorithm
- channel router algorithm
- coarse-to-fine algorithm
- column sweep algorithm
- combinatorial algorithm
- computational algorithm
- computing algorithm
- conservative algorithm
- control algorithm
- convergent algorithm
- curve-fitting algorithm
- cutting-plane algorithm
- D-algorithm
- decision algorithm
- decoding algorithm
- demand-paging algorithm
- deterministic algorithm
- digit-by-digit algorithm
- divide-and-conquer algorithm
- double-sweep algorithm
- draphics algorithm
- drawing algorithm
- DSP algorithm
- dual algorithm
- durable algorithm
- earliest-deadline-first algorithm
- edge-based algorithm
- event-scheduling algorithm
- exchange algorithm
- fault-handling algorithm
- fine-to-coarse algorithm
- fixed-stealing algorithm
- fixed-step-size algorithm
- flow-synthesis algorithm
- forward-looking algorithm
- generalized algorithm
- genetic algorithm
- Goto algorithm
- graph algorithm
- graph traversal algorithm
- greedy algorithm
- grid expansion algorithm
- hardware algorithm
- heuristic algorithm
- Hightower algorithm
- incorrect algorithm
- inference-based algorithm
- inferencing algorithm
- instruction issue algorithm
- integer algorithm
- integrated query optimization algorithm
- iteration algorithm
- iterative algorithm
- layout algorithm
- layout copmaction algorithm
- leaky bucket algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-expansion algorithm
- Lee-type algorithm
- levelization algorithm
- linear expansion algorithm
- line-placing algorithm
- line-probe algorithm
- logical algorithm
- mathematically based algorithm
- mathematically intensive algorithm
- maximum matching algorithm
- mesh algorithm - minimum path-length algorithm
- modeling algorithm
- multikey algorithm
- multipass algorithm
- nested algorithm
- network algorithm
- normal algorithm
- no-wait algorithm
- operative algorithm
- optimal assignment algorithm
- optimal cutting algorithm
- ordering algorithm
- page-replacement algorithm
- paging algorithm
- parallel algorithm
- partitioning algorithm
- path-tracing algorithm
- pipeline algorithm
- pitch algorithm
- placement algorithm
- prediction algorithm
- primal-dual algorithm
- primary algorithm
- problem algorithm
- procrastination algorithm
- public-key algorithm
- quorum-based algorithm
- random search algorithm
- recognition algorithm
- recursive algorithm
- relaxation algorithm
- replicate algorithm
- robust algorithm
- round-robin algorithm
- routing algorithm
- scanline algorithm
- scheduling algorithm
- sequential algorithm
- shortest path algorithm
- shrinking algorithm
- simplex algorithm
- simulated annealing algorithm
- software algorithm
- spanning tree algorithm
- speech generation algorithm
- speed-enhancing algorithm
- square rooting algorithm
- steepest ascent algorithm
- systolic algorithm
- testing algorithm
- text-to-speech algorithm
- threshold decoding algorithm
- timetable scheduling algorithm
- trace back algorithm
- translation algorithm
- transportation algorithm
- tree-search algorithm
- two-dimensional placement algorithm
- two-list algorithm
- type-inferencing algorithm
- unconstrained minimization algorithm
- universal algorithm
- variable-stealing algorithm
- Vintr algorithm
- VLSI algorithm
- write-back algorithmEnglish-Russian dictionary of computer science and programming > algorithm
-
3 algorithm
1) алгоритм2) правило; процедура; метод•- adaptive algorithm
- Agarval-Cooley algorithm
- aim algorithm
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- backoff algorithm
- back propagation of error algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm - CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm - greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm - iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-Moore algorithm
- Lee algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm - min-cut algorithm - nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- quantum search algorithm
- quick-union algorithm
- quick-union algorithm with path compression
- Q-R-algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm - routing algorithm
- Rprop algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm - self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm - shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithm -
4 algorithm
1) алгоритм2) правило; процедура; метод•- Agarval-Cooley algorithm
- aim algorithm
- algorithm of doubtful convergence
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- back propagation of error algorithm
- backoff algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm
- British Telecom Lempel-Ziv algorithm
- BTLZ algorithm
- CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm
- genetic algorithm
- graph search algorithm
- greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm
- international data encryption algorithm
- iterative algorithm
- iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-algorithm
- Lee-Moore algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm
- message authentication algorithm
- metaheuristic algorithm
- min-cut algorithm
- modified Gram-Schmidt algorithm
- Nelder-Mead simplex algorithm
- nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- Q-R-algorithm
- quantum search algorithm
- quick-union algorithm with path compression
- quick-union algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm
- Rivest-Shamir-Adleman algorithm
- robust algorithm
- routing algorithm
- RProp algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm
- secure hash algorithm
- selective-trace algorithm
- self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm
- sequential leader clustering algorithm
- serial algorithm
- shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithmThe New English-Russian Dictionary of Radio-electronics > algorithm
См. также в других словарях:
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… … Wikipedia
Force-based algorithms — Force based or force directed algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two dimensional or three dimensional space so that all the edges are of… … Wikipedia
Minimum spanning tree-based segmentation — Contents 1 Image segmentation introduction 2 Motivation for graph based methods 3 From images to graphs 4 Minimum Spanning Tree segmentation algorithms … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Dijkstra–Scholten algorithm — The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and C. S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980. First, let us consider the case of … Wikipedia
